Comparison of Multicast Algorithm Evaluation Results in Low and High Multicast Saturation Environments
نویسندگان
چکیده
منابع مشابه
Multicast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملA Low-Cost Algorithm for Multicast Routing
This paper presents a low-cost algorithm for multicast routing in computer networks. For performance evaluation, it is compared with Link-State multicast routing, which is a low-delay algorithm used by the Internet MOSPF protocol 1]. This new algorithm supports the group concept and the unknown-destination delivery. It uses a minimum average distance method to select the forwarding links to ach...
متن کاملSecure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. However, this raises the problem of ‘‘one affects all’’, whereby the actions of one member affect the whole group. Many researchers have solved the problem by dividing a group into several subgroups, but most current solutions r...
متن کاملA Multicast Routing Algorithm for Mobile Computing Environments
In this paper, we propose the XYZ infrastructure and algorithm for multicast routing in heterogeneous wireless/wireline environments. XYZ has two goals: (a) to reduce the latency and overhead of joins, leaves, and handoos in regions that experience high group dynamics and mobility, and (b) to optimize the multicast tree for stable regions that do not experience frequent group dynamics. XYZ cons...
متن کاملMultiobjective Multicast Routing Algorithm
This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one run, without a priori restrictions. Sim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Telecommunications and Information Technology
سال: 2019
ISSN: 1509-4553,1899-8852
DOI: 10.26636/jtit.2019.135019